Scalable Ethernet Clos-Switches
نویسندگان
چکیده
Scalability of Cluster-Computers utilizing Gigabit-Ethernet as an interconnect is limited by the unavailability of scalable switches that provide full bisectional bandwidth. Clos’ idea of connecting small crossbar-switches to a large, non-blocking crossbar – wide-spread in the field of high-performance networks – is not applicable in a straightforward manner to Ethernet fabrics. This paper presents techniques necessary to implement such large crossbar-switches based on available Gigabit-Ethernet technology. We point out the ability to build GigabitEthernet crossbar switches of up to 1152 ports providing full bisectional bandwidth. The cost of our configuration is at about e125 per port, with an observed latency of less than 10μsec. We were able to find a bidirectional point-to-point throughput of 210 MB/s using the ParaStation Cluster middle-ware[2].
منابع مشابه
Distro: a distributed static round-robin scheduling algorithm for bufferless Clos-Network switches
AbslradThe Clos-nehuork is widely recognized as a s.ealable arehitechlre for high-performance switches and routerr. Since more contention points are introduced in the multistage network, eel1 buffers are commonly used to resolve the contention. Recently, several scheduling algorithms hare been proposed for the buffered ClosNetwork switches. These approaches will came either mis-sequence or memo...
متن کاملStatic round-robin dispatching schemes for clos-network switches - High Performance Switching and Routing, 2002. Merging Optical and IP Technologies. Workshop on
AbstracfThe Clos-network is widely recognized as a scalable architecture for high-performance switches and routers. One of the key challenges in designing a Closnetwork switch for a high-speed environment is the design of the dispatchinglscheduling so as to be efficient for a wide range of traffic patterns, yet practical to be implemented in hardware. Based on the Static Round-Robin scheduling ...
متن کاملA dual-level matching algorithm for 3-stage Clos-network packet switches
In this paper, we present a new dual-level matching algorithm for 3-stage Clos-network packet switches, called d-MAC. Using a two-level matching algorithm, namely module-level matching and port-level matching, d-MAC is highly scalable and maintains high system performance. The module-level matching is responsible for finding the module-to-module matching according to the queue status of the swi...
متن کاملJohn von Neumann Institute for Computing A Scalable Ethernet Clos-Switch
c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...
متن کاملTopologies and routing in Gigabit switching fabrics
The ever increasing demand for bandwidth in computer networking has seen an evolution from the 3 Mbps Ethernet of 1976 to 1 Gbps Ethernet today with 10 Gbps available soon. This evolution in bandwidth has presented the network vendors with an increasing range of challenges when producing high capacity switches with a large number of ports. In this paper we study three different scalable topolog...
متن کامل